Number of different words that can be formed from all letters of word APPLICATION such that two

English

Gujarati

Hindi

6.Permutation and Combination

normal

Number of different words that can be formed from all letters of word $APPLICATION$ such that two vowels never come together is -

A

$(45)7!$

B

$8!$

C

$6!7!$

D

$(32)6!$

Solution

$\underbrace{A, I, A, D}_{5}\,\,\, \&\,\,\, \underbrace{P, P, L, C, T, N}_{6}$

ways $=\frac{6 !}{2 !} \cdot^{7} \mathrm{C}_{5} \cdot \frac{5 !}{2 ! 2 !}=(45) 7 !$

Standard 11

Mathematics

Share

Similar Questions

If $n = ^mC_2,$ then the value of $^n{C_2}$ is given by

hard

(AIEEE-2012)

A car will hold $2$ in the front seat and $1$ in the rear seat. If among $6$ persons $2$ can drive, then the number of ways in which the car can be filled is

medium

All possible numbers are formed using the digits $1, 1, 2, 2, 2, 2, 3, 4, 4$ taken all at a time. The number of such numbers in which the odd digits occupy even places is

hard

(JEE MAIN-2019)

Statement$-1:$ The number of ways of distributing $10$ identical balls in $4$ distinct boxes such that no box is empty is $^9C_3 .$

Statement$-2:$ The number of ways of choosing any $3$ places from $9$ different places is $^9C_3 $.

hard

(AIEEE-2011)

An urn contains $5$ red marbles, $4$ black marbles and $3$ white marbles. Then the number of ways in which $4$ marbles can be drawn so that at the most three of them are red is

medium

(JEE MAIN-2020)